Java

Share an insight from having analyzed your colleagues posting and application.

Or Offer your opinion and possible alternatives for solution details.

Or Evaluate and validate an idea with your own experience.

Or Make a suggestion and expand on below

A tree is a basically a data structure consisting of nodes organized as a hierarchy, it does not contain data but a view of the data by querying its a data model. Trees consists of nodes in descending order and every tree has a root node. Tree nodes can have children called branch nodes and those which cannot have children called leaf nodes. Note that the nodes can be identified either by tree path or by display row, where each row displays one node. Advantages of Trees They reflect structured relationships in data Trees are used to represent hierarchies Trees provide an efficient insertion and searching Very flexible data, allowing to move subtrees around with minimum effort. I would like to talk about binary Tree and Red Black Tree; Binary Tree; In binary tree each node has zero, one and two making tree operations simple and efficient. The methods for binary tree are preorder, post order and in-order. The recursively traverse both the left and right sub-trees and visit the current node. As far as the Red Black Tree; It self-balances the structure that applies color to each of its nodes Each node must be either red or black The root is always black every red node must have two black child nodes. Every path from a node to any of its descendent trees must contain the same number black nodes.