layout: post title: “Trees, they are the same in real life” date: 2015-07-10 06:19:49 categories: Software Development, Node, Root, Parent, Chilld, Size, Leaves, Levels, Trees, Lists, Arrays, Linked list, Binary trees, N-ary trees, Leaf, Traversal, Postorder, Preorder, Inorder, Root, Infix, Postfix, Expressions, Arithmetic, Class, C++, C, Recursion, Recursive banner_image: “” featured: false comments: true —

I was researching a bit on trees, and found this useful presentation on Binary Trees. Though it also has a mention of N-Ary trees, the real crux of N-Ary trees can be found in books by O’Rielly. I shall speak about this a bit later, but for now I’ ll leave you with this presentation:

(courtesy and copyrighted by Rick Mercer)

Technorati Tags: Software Development, Node, Root, Parent, Chilld, Size, Leaves, Levels, Trees, Lists, Arrays, Linked list, Binary trees, N-ary trees, Leaf, Traversal, Postorder, Preorder, Inorder, Root, Infix, Postfix, Expressions, Arithmetic, Class, C++, C, Recursion, Recursive