GitHub - mayank05942/Binary-Trees

Basic Terminology for trees:

1- Root: Node with no parent

2- Edge: Link from parent to child

3- Leaf: Node with no children

4- Sibling: Childern of same parent

5- Ancestor: means parent,grandparent,great grandparent and so on

6 -Depth of a node: Length of the path from root to node

7 -Height of a node: Length of path from node to deepest node

8 -Height of a tree: Same as height of root node

9 -Depth of a tree: Same as Depth of root node.

10- Predecessor of a node is the immediate prev node in inorder traversal of the binary tree

11- Successor of a node is the immediate next node in inorder traversal of the binary tree

Name		Name	Last commit message	Last commit date
Latest commit History 42 Commits
BST		BST
Compare or verify properties		Compare or verify properties
Generate Binary Tree		Generate Binary Tree
Trie		Trie
Binary Tree Inorder Traversal		Binary Tree Inorder Traversal
Binary Tree Postorder traversal		Binary Tree Postorder traversal
Binary Tree Preorder Traversal		Binary Tree Preorder Traversal
Binary Tree implementation		Binary Tree implementation
DFS AND BFS		DFS AND BFS
Depth and Height of Binary Tree		Depth and Height of Binary Tree
Leaf Similar Trees		Leaf Similar Trees
Level Order Traversal		Level Order Traversal
Questions on Trees		Questions on Trees
README.md		README.md
Two Sum IV		Two Sum IV
Zigzag Level Order Traversal		Zigzag Level Order Traversal