Uses of Class
com.amritpandey23.dsalibrary.tree.TreeNode

Packages that use TreeNode

Package	Description
com.amritpandey23.dsalibrary.tree

Uses of TreeNode in com.amritpandey23.dsalibrary.tree

Fields in com.amritpandey23.dsalibrary.tree declared as TreeNode

Modifier and Type	Field	Description
TreeNode<T>	TreeNode.left	Pointer to the left child node.
TreeNode<T>	TreeNode.right	Pointer to the right child node.

Methods in com.amritpandey23.dsalibrary.tree that return TreeNode

Modifier and Type	Method	Description
static TreeNode<Integer>	BinarySearchTree.delete(TreeNode<Integer> node, Integer val)	Deletes a specified value from the binary search tree.
static TreeNode<Integer>	BinarySearchTree.insert(TreeNode<Integer> node, Integer val)	Inserts a specified value into the binary search tree.

Methods in com.amritpandey23.dsalibrary.tree with parameters of type TreeNode

Modifier and Type	Method	Description
static TreeNode<Integer>	BinarySearchTree.delete(TreeNode<Integer> node, Integer val)	Deletes a specified value from the binary search tree.
static <T> Integer	SizeOfBinaryTree.getSizeIteratively(TreeNode<T> node)	Calculates the size of a binary tree iteratively.
static <T> Integer	SizeOfBinaryTree.getSizeRecursively(TreeNode<T> node)	Calculates the size of a binary tree recursively.
static TreeNode<Integer>	BinarySearchTree.insert(TreeNode<Integer> node, Integer val)	Inserts a specified value into the binary search tree.
static boolean	BinarySearchTree.search(TreeNode<Integer> node, Integer val)	Searches for a specified value in the binary search tree.
static <T> List<T>	SerializeTreeToList.serializeTree(TreeNode<T> node)	Serializes the binary tree rooted at the specified node into a list using level-order traversal.
static boolean	BinarySearchTree.validate(TreeNode<Integer> node)	Validates if the given binary tree is a binary search tree (BST).

Constructors in com.amritpandey23.dsalibrary.tree with parameters of type TreeNode

Modifier	Constructor	Description
	TreeNode(T val, TreeNode<T> left, TreeNode<T> right)	Constructs a tree node with a specified value, left child, and right child.