GitHub - prathameshbhalekar/Trees-Placement-Questions: Solutions to questions related to tree data structure.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 37 Commits
Binary Tree To Sum Tree		Binary Tree To Sum Tree
Binary Tree to Binary Search Tree Conversion.java		Binary Tree to Binary Search Tree Conversion.java
Binary Tree to Doubly Linked List		Binary Tree to Doubly Linked List
Boundary Traversal Of Binary Tree		Boundary Traversal Of Binary Tree
Brothers From Different Roots.java		Brothers From Different Roots.java
Check Mirror in N-ary tree		Check Mirror in N-ary tree
Check if All leaf node are at same level or not		Check if All leaf node are at same level or not
Check if Binary Tree is Sum tree or not		Check if Binary Tree is Sum tree or not
Check if Tree is Isomorphic		Check if Tree is Isomorphic
Check if a Binary Tree contains duplicate subtrees of size 2 or more		Check if a Binary Tree contains duplicate subtrees of size 2 or more
Construct BST from given preorder traversal.java		Construct BST from given preorder traversal.java
Convert a normal BST to Balanced BST.java		Convert a normal BST to Balanced BST.java
Count BST nodes that lie in a given range.java		Count BST nodes that lie in a given range.java
Create Tree from Inorder and Level order traversal		Create Tree from Inorder and Level order traversal
Diagonal Traversal of Binary Tree		Diagonal Traversal of Binary Tree
Find largest subtree sum in a tree		Find largest subtree sum in a tree
Kth ancestor of a node in binary tree		Kth ancestor of a node in binary tree
Kth largest element in BST.java		Kth largest element in BST.java
Left View.java		Left View.java
Level order traversal in spiral form		Level order traversal in spiral form
Lowest Common Ancestor in a BST.java		Lowest Common Ancestor in a BST.java
Lowest Common Ancestor in a Binary Tree		Lowest Common Ancestor in a Binary Tree
Maximum sum of nodes in Binary tree such that no two are adjacent		Maximum sum of nodes in Binary tree such that no two are adjacent
Merge two BSTs,java		Merge two BSTs,java
Min distance between two given nodes of a Binary Tree		Min distance between two given nodes of a Binary Tree
Minimum swap required to convert binary tree to binary search tree		Minimum swap required to convert binary tree to binary search tree
Print all k-sum paths in a binary tree		Print all k-sum paths in a binary tree
Sum of nodes on the longest path from root to leaf node		Sum of nodes on the longest path from root to leaf node
Tree from Bracket Representation		Tree from Bracket Representation
binary search tree implementation		binary search tree implementation
nth node		nth node
post order traversal form inorder and preorder traversal		post order traversal form inorder and preorder traversal
top view of binary tree		top view of binary tree

prathameshbhalekar/Trees-Placement-Questions

Folders and files

Latest commit

History

About

Topics

Stars

Watchers

Forks

Languages