C# (CSharp) LeetCodeProblems.TreeProblems.GeeksForGeeks_Inorder_Predecessor GeeksForGeeksNode Beispiele

Beispiel #1

        private GeeksForGeeksNode GetInorderPredecessor(GeeksForGeeksNode node)
        {
            var current = node;

            while (current.Right != null)
            {
                current = current.Right;
            }
            return(current);
        }

Beispiel #2

        public int FindPredecessor(GeeksForGeeksNode node)
        {
            if (node.Left == null)
            {
                return(node.Value);
            }

            var predecessor = GetInorderPredecessor(node.Left);

            return(predecessor.Value);
        }